A constant-time chunking algorithm for packet-level deduplication
نویسندگان
چکیده
منابع مشابه
FastCDC: a Fast and Efficient Content-Defined Chunking Approach for Data Deduplication
Content-Defined Chunking (CDC) has been playing a key role in data deduplication systems in the past 15 years or so due to its high redundancy detection ability. However, existing CDC-based approaches introduce heavy CPU overhead because they declare the chunk cutpoints by computing and judging the rolling hashes of the data stream byte by byte. In this paper, we propose FastCDC, a Fast and eff...
متن کاملA Linear Time, Constant Space Differencing Algorithm
An efficient differencing algorithm can be used to compress version of files for both transmission over low bandwidth channels and compact storage. This can greatly reduce network traffic and execution time for distributed applications which include software distribution, source code control, file system replication, and data backup and restore. An algorithm for such applications needs to be bo...
متن کاملHTTP-Level Deduplication with HTML5
In this project, we examine HTTP-level duplication. We first report on our initial measurement study, analyzing the amount and types of duplication in the Internet today. We then discuss several opportunities for deduplication: in particular, we implement two versions of a simple server-client architecture that takes advantage of HTML5 client-side storage for value-based caching and deduplication.
متن کاملA Space-Time Constant Modulus Algorithm for SDMA Systems
C. B. Papadias and A. Paulraj Information Systems Laboratory Stanford University, Stanford CA 94305, U.S.A. Abstract|We consider the problem of blind recovery of p synchronous i.i.d. communication signals that are transmitted through a linear spatio-temporal channel and captured by an m element array. Such a situation may arise for example in a Space-Division-Multiple-Access (SDMA) mobile commu...
متن کاملA constant-time algorithm for middle levels Gray codes
For any integer n ≥ 1 a middle levels Gray code is a cyclic listing of all nelement and (n+ 1)-element subsets of {1, 2, . . . , 2n+ 1} such that any two consecutive subsets differ in adding or removing a single element. The question whether such a Gray code exists for any n ≥ 1 has been the subject of intensive research during the last 30 years, and has been answered affirmatively only recentl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICT Express
سال: 2019
ISSN: 2405-9595
DOI: 10.1016/j.icte.2018.05.005